package LeetCode刷题;

/**
 * @program: Java_Study
 * @author: Xiaofan
 * @createTime: 2022-02-23 10:37
 * @description: Functions of this class is
 * 官方题解：
 * class Solution {
 *     public int longestCommonSubsequence(String text1, String text2) {
 *         int m = text1.length(), n = text2.length();
 *         int[][] dp = new int[m + 1][n + 1];
 *         for (int i = 1; i <= m; i++) {
 *             char c1 = text1.charAt(i - 1);
 *             for (int j = 1; j <= n; j++) {
 *                 char c2 = text2.charAt(j - 1);
 *                 if (c1 == c2) {
 *                     dp[i][j] = dp[i - 1][j - 1] + 1;
 *                 } else {
 *                     dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
 *                 }
 *             }
 *         }
 *         return dp[m][n];
 *     }
 * }
 **/
public class No最长公共子序列 {
    public static void main(String[] args) {

    }
}